An unbreakable cryptosystem for common people

It has been found that an algorithm can generate true random numbers on classical computer. The algorithm can be used to generate unbreakable message PIN (personal identification number) and password. Cryptography has long history [1]. Interestingly, it has been found that taking key material from open source it is possible to design unbreakable crypto-system. Following the technique [2] an algorithm [3] has also been designed for the generation of arbitrary numbers of random numbers. Using the algorithm [3] distant parties can generate common key if they give the same inputs which are three sequences of random numbers. It means distant parties have to secretly share the initial inputs. Common people can use the algorithms because only for one time common people can easily generate some random numbers by tossing coin. No need of taking any help from third party to procure secret key. Suppose the output of the algorithm , that is a n-bit key, is used to encrypt a n-bit message. Eavesdropper’s probability of guessing the n-bit key/message is 1/2. The system is information theoretically completely secure. However, eavesdropper can steal some messages and decode the message encrypting keys to know their secret keys S , (S ) and , and thereby unused message encrypting keys. This attack is known as plaintext-attack. To know this information eavesdropper has to generate outputs giving his own input sequences S , S ( ) and S . Total number of probable three input sequences is 2 M 0 F 1 S F 2 C S